Linking chemical knowledge and genetic algorithms using two populations and focused multimodal search

نویسندگان

  • M. P. Gómez-Carracedo
  • M. Gestal
چکیده

Many analytical problems involve measurement of a large number of experimental variables on a set of samples. Unfortunately, some of them can deteriorate the performance of classification models because not all variables yield the same quality and quantity of information. In this paper four strategies to perform variable selection in mid-infrared spectral data using genetic algorithms (GAs) are presented: fixed search, pruned search, multimodal search by hybrid two-population GA, HTP–GA, and focused HTP–GA. They can be easily tailored to favour either the reduction in the number of variables, the classification abilities of the overall model or the chemical understanding. Focused HTP–GA in particular allows introduction of chemical information in the GA fitness function and, thus, obtains mathematical solutions which are chemically-driven as well. This, therefore, simplifies the chemical interpretation of the models. To the best of our knowledge this is the first application in the Analytical Chemistry field where a GA is used to find out a solution with chemical meaning since current applications interpret the variables once they are extracted. Selected variables were used to implement a screening procedure to ascertain the amount of pure apple juice in commercial beverages employing backpropagation artificial neural networks (ANNs). The influence of each GA on the classification results was evaluated following a twofold approach. First, the GAs were coupled to an ANN with a fixed topology so that the differences on the classifications depended (mainly) on the GA-selected variables. Second, the ANNs were optimized and the overall GA–ANN models compared. © 2007 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IIR System Identification Using Improved Harmony Search Algorithm with Chaos

Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...

متن کامل

Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling

The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...

متن کامل

Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization

In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...

متن کامل

A Novel Experimental Analysis of the Minimum Cost Flow Problem

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007